Generating problem sets with word processing software
نویسندگان
چکیده
منابع مشابه
Conway's problem for three-word sets
We prove two results on commutation of languages. First, we show that the maximal language commuting with a three-element language, i.e. its centralizer, is rational, thus giving an a5rmative answer to a special case of a problem proposed by Conway in 1971. Second, we characterize all languages commuting with a three-element code. The characterization is similar to the one proved by Bergman for...
متن کاملGenerating Sets
In Rn, every vector can be written as a (unique) linear combination of the standard basis e1, . . . , en. A notion weaker than a basis is a spanning set: a set of vectors in R n is a spanning set if its linear combinations fill up the whole space. The difference between a spanning set and a basis is that a spanning set may contain more vectors than necessary to span the space. For instance, {(1...
متن کاملSolving The Software Productivity & Parallel Processing Problem
There are two major problems facing the U.S. Software Industry. They are not new. The first, programmer productivity, has been a major concern since the earliest programmable computers in the 1950s. The second, using parallel processors to gain speed, has been addressed since the 1960s. The solution to both of these problems must be embedded in the design of the programming language used to sol...
متن کاملGaiku : Generating Haiku with Word Associations Norms
creativeness / a pleasing field / of bloom Word associations are an important element of linguistic creativity. Traditional lexical knowledge bases such as WordNet formalize a limited set of systematic relations among words, such as synonymy, polysemy and hypernymy. Such relations maintain their systematicity when composed into lexical chains. We claim that such relations cannot explain the typ...
متن کاملGenerating All Sets With Bounded Unions
We consider the problem of minimizing the size of a family of sets G such that every subset of {1, . . . , n} can be written as a disjoint union of at most k members of G, where k and n are given numbers. This problem originates in a real-world application aiming at the diversity of industrial production. At the same time, the question of finding the minimum of |G| so that every subset of {1, ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Physics
سال: 1987
ISSN: 0002-9505,1943-2909
DOI: 10.1119/1.15264